Enhanced sharing analysis techniques: a comprehensive evaluation

Sharing, an abstract domain developed by D. Jacobs and A. Langen for the analysis of logic programs, derives useful aliasing information. It is well-known that a commonly used core of techniques, such as the integration of Sharing with freeness and linearity information, can significantly improve the precision of the analysis. However, a number of other proposals for refined domain combinations have been circulating for years. One feature that is common to these proposals is that they do not seem to have undergone a thorough experimental evaluation even with respect to the expected precision gains. In this paper we experimentally evaluate: helping Sharing with the definitely ground variables found using Pos, the domain of positive Boolean formulas; the incorporation of explicit structural information; a full implementation of the reduced product of Sharing and Pos; the issue of reordering the bindings in the computation of the abstract mgu; an original proposal for the addition of a new mode recording the set of variables that are deemed to be ground or free; a refined way of using linearity to improve the analysis; the recovery of hidden information in the combination of Sharing with freeness information. Finally, we discuss the issue of whether tracking compoundness allows the computation of more sharing information

A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages

It is well known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of logic programs to be improved. In this paper, we present a novel combination of set-sharing with freeness and linearity information, which is characterized by an improved abstract unification operator. We provide a new abstraction function and prove the correctness of the analysis for both the finite tree and the rational tree cases. Moreover, we show that the same notion of redundant information as identified in Bagnara et al. (2000) and Zaffanella et al. (2002) also applies to this abstract domain combination: this allows for the implementation of an abstract unification operator running in polynomial time and achieving the same precision on all the considered observable properties

Soundness, idempotence and commutativity of set-sharing

It is important that practical data-flow analyzers are backed by reliably proven theoretical results. Abstract interpretation provides a sound mathematical framework and necessary generic properties for an abstract domain to be well-defined and sound with respect to the concrete semantics. In logic programming, the abstract domain Sharing is a standard choice for sharing analysis for both practical work and further theoretical study. In spite of this, we found that there were no satisfactory proofs for the key properties of commutativity and idempotence that are essential for Sharing to be well-defined and that published statements of the soundness of Sharing assume the occurs-check. This paper provides a generalization of the abstraction function for Sharing that can be applied to any language, with or without the occurs-check. Results for soundness, idempotence and commutativity for abstract unification using this abstraction function are proven

Verifying termination and error-freedom of logic programs with block declarations

We present verification methods for logic programs with delay declarations. The verified properties are termination and freedom from errors related to built-ins. Concerning termination, we present two approaches. The first approach tries to eliminate the well-known problem of speculative output bindings. The second approach is based on identifying the predicates for which the textual position of an atom using this predicate is irrelevant with respect to termination. Three features are distinctive of this work: it allows for predicates to be used in several modes; it shows that block declarations, which are a very simple delay construct, are sufficient to ensure the desired properties; it takes the selection rule into account, assuming it to be as in most Prolog implementations. The methods can be used to verify existing programs and assist in writing new programs

Excitons in Mott insulators

Motivated by recent Raman and resonant inelastic X-ray scattering experiments performed for Mott insulators, which suggest formation of excitons in these systems, we present a theory of exciton formation in the upper Hubbard band. The analysis based on the spin polaron approach is performed in the framework of an effective t-J model for the subspace of states with one doubly occupied site. Our results confirm the existence of excitons and bear qualitative resemblance to experimental data despite some simplifications in our approach. They prove that the basic underlying mechanismof exciton formation is the same as that which gives rise to binding of holes in weakly doped antiferromagnets.Comment: 4 pages, 1 figur

Maximal strength training enhances strength and functional performance in chronic stroke survivors

Objective: This study aimed to demonstrate that maximal strength training improves muscle strength and to assess the effect of training on function, aerobic status, and quality-of-life among chronic stroke survivors. Design: Ten patients acted as their own controls for 4 wks, before an 8-week training intervention. Patients trained 3 days/wk, with four sets of four repetitions at 85%–95% one repetition maximum in unilateral leg press and plantarflexion with an emphasis on maximal mobilization of force in the concentric phase. Results: After training, leg press strength improved by 30.6 kg (75%) and 17.8 kg (86%); plantarflexion strength improved by 35.5 kg (89%) and 28.5 kg (223%) for the unaffected and affected limbs, respectively, significantly different from the control period (all P < 0.01). The 6-min walk test improved by 13.9 m (within training period; P = 0.01), and the Timed Up and Go test time improved by 0.6 secs (within training period; P < 0.05). There were no significant changes in walking economy, peak aerobic capacity, Four-Square Step Test, or health-related quality-of-life after training. Conclusions: Maximal strength training improved muscle strength in the most affected as well as in the nonaffected leg and improved Timed-Up-And-Go time and 6-min walk distance but did not alter Four-Step Square Test time, aerobic status, or quality-of-life among chronic stroke survivors

Cosmological Tracking Solutions

A substantial fraction of the energy density of the universe may consist of quintessence in the form of a slowly-rolling scalar field. Since the energy density of the scalar field generally decreases more slowly than the matter energy density, it appears that the ratio of the two densities must be set to a special, infinitesimal value in the early universe in order to have the two densities nearly coincide today. Recently, we introduced the notion of tracker fields to avoid this initial conditions problem. In the paper, we address the following questions: What is the general condition to have tracker fields? What is the relation between the matter energy density and the equation-of-state of the universe imposed by tracker solutions? And, can tracker solutions explain why quintessence is becoming important today rather than during the early universe

The role of manufacturing and market managers in strategy development:lessons from three companies

According to researchers and managers, there is a lack of agreement between marketing and manufacturing managers on critical strategic issues. However, most of the literature on the subject is anecdotal and little formal empirical research has been done. Three companies are investigated to study the extent of agreement/disagreement between manufacturing and marketing managers on strategy content and process. A novel method permits the study of agreement between the two different functional managers on the process of developing strategy. The findings consistently show that manufacturing managers operate under a wider range of strategic priorities than marketing managers, and that manufacturing managers participate less than marketing managers in the strategy development process. Further, both marketing and manufacturing managers show higher involvement in the strategy development process in the latter stages of the Hayes and Wheelwright four-stage model of manufacturing’s strategic role

Automatic Inference of Determinacy and Mutual Exclusion for Logic Programs Using Mode and Type Analyses

We propose an analysis for detecting procedures and goals that are deterministic (i.e., that produce at most one solution at most once),or predicates whose clause tests are mutually exclusive (which implies that at most one of their clauses will succeed) even if they are not deterministic. The analysis takes advantage of the pruning operator in order to improve the detection of mutual exclusion and determinacy. It also supports arithmetic equations and disequations, as well as equations and disequations on terms,for which we give a complete satisfiability testing algorithm, w.r.t. available type information. Information about determinacy can be used for program debugging and optimization, resource consumption and granularity control, abstraction carrying code, etc. We have implemented the analysis and integrated it in the CiaoPP system, which also infers automatically the mode and type information that our analysis takes as input. Experiments performed on this implementation show that the analysis is fairly accurate and efficient